Implicit and noncomputational arguments using monads
نویسندگان
چکیده
We provide a monadic view on implicit and noncomputational arguments. This allows us to treat Berger’s non-computational quantifiers in the Coq-system. We use Tait’s normalization proof and the concatenation of vectors as case studies for the extraction of programs. With little effort one can eliminate noncomputational arguments from extracted programs. One thus obtains extracted code that is not only closer to the intended one, but also decreases both the running time and the memory usage dramatically. We also study the connection between Harrop formulas, lax modal logic and the Coq type theory.
منابع مشابه
یافتن الگوهای مکرّر در قرآن کریم بهکمک روشهای متنکاوی
Quran’s Text differs from any other texts in terms of its exceptional concepts, ideas and subjects. To recognize the valuable implicit patterns through a vast amount of data has lately captured the attention of so many researchers. Text Mining provides the grounds to extract information from texts and it can help us reach our objective in this regard. In recent years, Text Mining on Quran and e...
متن کاملLeibniz’s Monads and Mulla Sadra’s Hierarchy of Being: A Comparative Study
Mulla Sadra and Leibniz, the two philosophers from the East and the West, belong to two different worlds. Though they were unaware of the ideas of each other, their philosophical systems share certain common points that are comparable. Monads constitute the basis of Leibniz's thought and he refers to their features in his various works. On the other side, Mulla Sadra's philosophy is also based ...
متن کاملSemantic Role Labeling of Implicit Arguments for Nominal Predicates
Nominal predicates often carry implicit arguments. Recent work on semantic role labeling has focused on identifying arguments within the local context of a predicate; implicit arguments, however, have not been systematically examined. To address this limitation, we have manually annotated a corpus of implicit arguments for ten predicates from NomBank. Through analysis of this corpus, we find th...
متن کاملCompound Monads and Models of Computation
We consider the theory of “extended subsitutions” involving both angelic and demonic choice. For other related formal theories describing program semantics the implicit model of computation is based on a combination of monads by a distributive law. We show how the model of computation underlying extended subsitutions is based on a monad which, while not being a compound monad, has strong simila...
متن کاملMonads-dp: Outline of an Object-oriented Concurrent Programming Model for Multiprocessor Systems
The main features of an Object-Oriented Concurrent Programming (OOCP) model called Monads-DP are introduced in this paper. Monads-DP is signiicantly different from other OOCP systems. Undirected Remote Procedure Calls are used in inter-object communication for which the target objects and methods are found by pattern matching. Objects apply implicit control for messages arriving to an object. M...
متن کامل